Learning Prototype Models for Tangent Distance
ثبت نشده
چکیده
true: 2 true proj. pred. proj. (0) true: 5 true proj. pred. proj. (8) true: 2 true proj. pred. proj. (0) true: 9 true proj. pred. proj. (4) true: 4 true proj. pred. proj. (7) Figure 2: Some of the errors for the test set corresponding to line (3) of table 4. Each case is displayed a s a c olumn of three images. The top is the true image, the middle the tangent projection of the true image onto the subspace m o del of its class, the bottom image the tangent projection of the image onto the winning class. The models are suuciently rich to allow distortions that can fool Euclidean distance. tangent subspace per class and the tangent distance is enough to outperform clas-siication using 1000 prototypes per class and the Euclidean distance (4:1% versus 5:5% on the test data). Table 1: Test errors for a variety of situations. In all cases the test data the 2007 USPS test digits. Each entry describes the model used i n e ach class, so for example in row 5 there a r e 5 m o dels per class, hence 5 0 i n a l l .
منابع مشابه
A Constructive Learning Algorithm for Discriminant Tangent Models
To reduce the computational complexity of classification systems using tangent distance, Hastie et al. (HSS) developed an algorithm to devise rich models for representing large subsets of the data which computes automatically the "best" associated tangent subspace. Schwenk & Milgram proposed a discriminant modular classification system (Diabolo) based on several autoassociative multilayer perce...
متن کاملLearning Prototype Models for Tangent Distance
Simard, LeCun & Denker (1993) showed that the performance of near-neighbor classi cation schemes for handwritten character recognition can be improved by incorporating invariance to speci c transformations in the underlying distance metric | the so called tangent distance. The resulting classi er, however, can be prohibitively slow and memory intensive due to the large amount of prototypes that...
متن کاملDiscriminant Pattern Recognition Using Transformation-Invariant Neurons
To overcome the problem of invariant pattern recognition, Simard, LeCun, and Denker (1993) proposed a successful nearest-neighbor approach based on tangent distance, attaining state-of-the-art accuracy. Since this approach needs great computational and memory effort, Hastie, Simard, and Säckinger (1995) proposed an algorithm (HSS) based on singular value decomposition (SVD), for the generation ...
متن کاملLearning Discriminant Tangent Models for Handwritten Character Recognition
Transformation invariance is known to be fundamental for excellent performances in pattern recognition. One of the most successful approach is tangent distance, originally proposed for a nearest-neighbor algorithm (Simard, LeCun and Denker, 1993). The resulting classifier, however, has a very high computational complexity and, perhaps more important, lacks discrimination capabilities. We presen...
متن کاملAn Evaluation of the WPE Algorithm Using Tangent Distance
Weighting Prototype Editing (WPE) is a novel approach to edit a given set of prototypes so that the resulting set can outperform the original one in terms of the Nearest Neighbor (NN) classification accuracy. This technique is applied in this work along with an interesting dissimilarity measure between pixel maps, known as Tangent Distance (TD). Experiments on the USPS handwriting digits benchm...
متن کامل